Splitting links that are too large
Consider an algorithm to split links that are too large.
Easy to implement
Split into multiple groups
What name to give it is delicate.
Proposal to grow keywords by involving surrounding words.
It will be the most human-friendly link name.
---
Links that are too large are complete graphs
The problem that inevitably arises when the number of pages to consider an algorithm for partitioning this complete graph increases
What will be the index for optimization then?
Not to minimize the increase in distance.
because if short distance is good, it is best to make all pages the same tag and all complete graphs with distance 1
We need to make divisions so that what should be near is near and what should be far away is far away.
---
This page is auto-translated from /nishio/大きすぎるリンクの分割. If you looks something interesting but the auto-translated English is not good enough to understand it, feel free to let me know at @nishio_en. I'm very happy to spread my thought to non-Japanese readers.